منابع مشابه
Nonconvex Minimization Problems
I. The central result. The grandfather of it all is the celebrated 1961 theorem of Bishop and Phelps (see [7], [8]) that the set of continuous linear functionals on a Banach space E which attain their maximum on a prescribed closed convex bounded subset X c E is norm-dense in £*. The crux of the proof lies in introducing a certain convex cone in E, associating with it a partial ordering, and ap...
متن کاملOn Iterated Minimization in Nonconvex Optimization
In dynamic programming and decomposition methods one often applies an iterated minimization procedure. The problem variables are partitioned into several blocks, say x and y. Treating y as a parameter, the first phase consists of minimization with respect to the variable x. In a second phase the minimization of the resulting optimal value function depending on y is considered. In this paper we ...
متن کاملSmoothing methods for nonsmooth, nonconvex minimization
We consider a class of smoothing methods for minimization problems where the feasible set is convex but the objective function is not convex, not differentiable and perhaps not even locally Lipschitz at the solutions. Such optimization problems arise from wide applications including image restoration, signal reconstruction, variable selection, optimal control, stochastic equilibrium and spheric...
متن کاملComposite Optimization by Nonconvex Majorization-Minimization
Many tasks in imaging can be modeled via the minimization of a nonconvex composite function. A popular class of algorithms for solving such problems are majorizationminimization techniques which iteratively approximate the composite nonconvex function by a majorizing function that is easy to minimize. Most techniques, e.g. gradient descent, utilize convex majorizers in order guarantee that the ...
متن کاملNonconvex Sorted l1 Minimization for Sparse Approximation
The l1 norm is the tight convex relaxation for the l0 “norm” and has been successfully applied for recovering sparse signals. However, for problems with fewer samples than required for accurate l1 recovery, one needs to apply nonconvex penalties such as lp “norm”. As one method for solving lp minimization problems, iteratively reweighted l1 minimization updates the weight for each component bas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tamkang Journal of Mathematics
سال: 2008
ISSN: 2073-9826,0049-2930
DOI: 10.5556/j.tkjm.39.2008.13